A 2-categorical framework for the syntax and semantics of many-sorted equational logic
نویسندگان
چکیده
Received 30 January 2008; revised 7 July 2008 In memory of Professor Tsuyoshi Fujiwara (1923–2006) Primary: 03C05, 03F25, 08A68, 08A40, 18A23, 18C10, 18D05; Secondary: 03C95, 68Q65.
منابع مشابه
Juan CLIMENT VIDAL and Juan SOLIVERES TUR A 2-CATEGORICAL FRAMEWORK FOR THE SYNTAX AND SEMANTICS OF MANY-SORTED EQUATIONAL LOGIC
Received 30 January 2008; revised 7 July 2008 In memory of Professor Tsuyoshi Fujiwara (1923–2006) Primary: 03C05, 03F25, 08A68, 08A40, 18A23, 18C10, 18D05; Secondary: 03C95, 68Q65.
متن کاملPresenting functors on many-sorted varieties and applications
This paper studies several applications of the notion of a presentation of a functor by operations and equations. We show that the technically straightforward generalisation of this notion from the one-sorted to the many-sorted case has several interesting consequences. First, it can be applied to give equational logic for the binding algebras modelling abstract syntax. Second, it provides a ca...
متن کاملA new framework for declarative programming
We propose a new framework for the syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over τ -categories: finite product categories with canonical structure. Constraint information is directly built-in to the notion of signature via categorical syntax. Many-sorted equational constraints are a special case of the formalism which combines feat...
متن کاملErratum to: "A new framework for declarative programming": [Theoret. Comput. Sci. 300 (2003) 91-160]
We propose a new framework for the syntax and semantics of Weak Hereditarily Harrop logic programming with constraints, based on resolution over -categories: 9nite product categories with canonical structure. Constraint information is directly built-in to the notion of signature via categorical syntax. Many-sorted equational constraints are a special case of the formalism which combines feature...
متن کاملTowards Behavioral Maude: Behavioral Membership Equational Logic
How can algebraic and coalgebraic specifications be integrated? How can behavioral equivalence be addressed in an algebraic specification language? The hidden-sorted approach, originating in work of Goguen and Meseguer in the early 80’s, and further developed into the hidden-sorted logic approach by researchers at Oxford, UC San Diego, and Kanazawa offers some attractive answers, and has been i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Reports on Mathematical Logic
دوره 45 شماره
صفحات -
تاریخ انتشار 2010